Tractable Construction of Relational Features
نویسنده
چکیده
A popular technique for converting multi-relational data into a single-relational form is based on constructing truth-valued relational features of the data instances, where the features play the role of binary attributes in the resulting representation. Here I consider a simple relational feature language whose formulas correspond to conjunctions of first-order atoms where arguments are only variables and respect userdefined constraints on types and input/output modes. I show a sufficient condition for polynomial time construction of such formulas and give preliminary results on tractable enumeration of complete sets of such formulas.
منابع مشابه
Efficient Sampling in Relational Feature Spaces
State-of-the-art algorithms implementing the ‘extended transformation approach’ to propositionalization use backtrack depth first search for the construction of relational features (first order atom conjunctions) complying to user’s mode/type declarations and a few basic syntactic conditions. As such they incur a complexity factor exponential in the maximum allowed feature size. Here I present ...
متن کاملType Extension Trees: a Unified Framework for Relational Feature Construction
We introduce type extension trees as a formal representation language for complex combinatorial features of relational data. Based on a very simple syntax this language provides a unified framework for expressing features as diverse as embedded subgraphs on the one hand, and marginal counts of attribute values on the other. We show by various examples how many existing relational data mining te...
متن کاملEnsemble Relational Learning based on Selective Propositionalization
Dealing with structured data needs the use of expressive representation formalisms that, however, puts the problem to deal with the computational complexity of the machine learning process. Furthermore, real world domains require tools able to manage their typical uncertainty. Many statistical relational learning approaches try to deal with these problems by combining the construction of releva...
متن کاملOptimization of the injection molding process of Derlin 500 composite using ANOVA and grey relational analysis
Warpage and shrinkage control are important factors in proving the quality of thin-wall parts in injection modeling process. In the present paper, grey relational analysis was used in order to optimize these two parameters in manufacturing plastic bush of articulated garden tractor. The material used in the plastic bush is Derlin 500. The input parameters in the process were selected according ...
متن کاملHybrid (V)CSPs and algebraic reductions
Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem that appears in many areas of Computer Science. It can be stated as computing a homomorphism R → Γ between two relational structures, e.g. between two directed graphs. Analyzing its complexity has been a very fruitfull research direction, especially for fixed template CSPs (or, non-uniform CSPs) denoted CSP(Γ), in which ...
متن کامل